Around the Razumov-Stroganov Conjecture: Proof of a Multi-Parameter Sum Rule
نویسندگان
چکیده
We prove that the sum of entries of the suitably normalized groundstate vector of the O(1) loop model with periodic boundary conditions on a periodic strip of size 2n is equal to the total number of n×n alternating sign matrices. This is done by identifying the state sum of a multi-parameter inhomogeneous version of the O(1) model with the partition function of the inhomogeneous six-vertex model on a n × n square grid with domain wall boundary conditions.
منابع مشابه
Razumov–Stroganov sum rule: a proof based on multi-parameter generalizations
We prove that the sum of entries of the suitably normalized groundstate vector of the O(1) loop model with periodic boundary conditions on a periodic strip of size 2n is equal to the total number of n× n alternating sign matrices. This is done by identifying the state sum of a multi-parameter inhomogeneous version of the O(1) model with the partition function of the inhomogeneous six-vertex mod...
متن کاملQuantum incompressibility and Razumov Stroganov type conjectures
We establish a correspondence between polynomial representations of the Temperley and Lieb algebra and certain deformations of the Quantum Hall Effect wave functions. When the deformation parameter is a third root of unity, the representation degenerates and the wave functions coincide with the domain wall boundary condition partition function appearing in the conjecture of A.V. Razumov and Y.G...
متن کاملProof of the Razumov-Stroganov Conjecture for some Infinite Families of Link Patterns
We prove the Razumov–Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the MacMahon formula for the number of plane partitions which includes three series of pa...
متن کاملThe Razumov-Stroganov conjecture: Stochastic processes, loops and combinatorics
The Razumov-Stroganov conjecture: Stochastic processes, loops and combinatorics 2
متن کاملA bijectional attack on the Razumov-Stroganov conjecture
We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005